Generation of permutation sequences: Part 2
نویسندگان
چکیده
منابع مشابه
Limits of permutation sequences
A permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ , the density of occurrences of τ in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function Z : [0, 1] → [0, 1] with the additional properties that, for every fixed x ∈ [0, 1], the restriction Z(x, ·) is a cumulativ...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملMultiplicity-Free Permutation Characters in GAP, part 2
We complete the classification of the multiplicity-free permutation actions of nearly simple groups that involve a sporadic simple group, which had been started in [BL96] and [LM].
متن کاملPermutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملRule based lexicographical permutation sequences
In a permutation sequence built by means of sub permutations, the transitions between successive permutations are subject to a set of n(n – 1)/2 rules that naturally group into n – 1 matrices with a high degree of regularity. By means of these rules, the sequence can be produced in O(3n!) time and O(n) space. To generate all permutations of a given set one can go for (among other things) a mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.2.136